public class BinaryTreeDemo {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        HeroNode root = new HeroNode(1,"宋江");
        HeroNode node1 = new HeroNode(2,"吴用");
        HeroNode node2 = new HeroNode(3,"卢俊义");
        HeroNode node3 = new HeroNode(4,"林冲");
        HeroNode node4 = new HeroNode(5,"关胜");

        binaryTree.setRoot(root);
        root.setLeft(node1);
        root.setRight(node2);
        node2.setLeft(node4);
        node2.setRight(node3);

//        System.out.println("前序排序：");
//        binaryTree.preOrder();
//
//        System.out.println("中序排序：");
//        binaryTree.infixOrder();
//
//        System.out.println("后序排序：");
//        binaryTree.postOrder();
//
//        System.out.print("前序查找5号信息：");
//        HeroNode resNode1 = binaryTree.preOrderSearch(5);
//        if(resNode1 != null){
//            System.out.println(resNode1);
//        }else{
//            System.out.println("没有找到");
//        }
//
//        HeroNode resNode2 = binaryTree.infixOrderSearch(5);
//        if(resNode2 != null){
//            System.out.println(resNode2);
//        }else{
//            System.out.println("没有找到");
//        }
//
//        HeroNode resNode3 = binaryTree.postOrderSearch(5);
//        if(resNode3 != null){
//            System.out.println(resNode3);
//        }else{
//            System.out.println("没有找到");
//        }

        System.out.println("删除前前序排序：");
        binaryTree.preOrder();
        System.out.println("删除后前序排序：");
        binaryTree.delNode(5);
        binaryTree.preOrder();

    }
}

class BinaryTree{
    private HeroNode root;

    //注意这里需要setRoot
    public void setRoot(HeroNode root) {
        this.root = root;
    }

    //前序遍历
    public void preOrder(){
        if(this.root != null){
            this.root.preOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //中序遍历
    public void infixOrder(){
        if(this.root != null){
            this.root.infixOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //后序遍历
    public void postOrder(){
        if(this.root != null){
            this.root.postOrder();
        }else{
            System.out.println("二叉树为空，无法遍历");
        }
    }

    //前序遍历查找
    public HeroNode preOrderSearch(int no){
        if(this.root != null){
            return root.preOrderSearch(no);
        }else{
            return null;
        }
    }

    //中序遍历查找
    public HeroNode infixOrderSearch(int no){
        if(this.root != null){
            return root.infixOrderSearch(no);
        }else{
            return null;
        }
    }

    //后序遍历查找
    public HeroNode postOrderSearch(int no){
        if(this.root != null){
            return root.postOrderSearch(no);
        }else{
            return null;
        }
    }

    //删除节点
    public void delNode(int no){
        if(root != null){
            if(root.getNo() == no){
                this.root = null;
            }else{
                root.delNode(no);
            }
        }else{
            System.out.println("没有找到该节点");
        }
    }

}

class HeroNode{
    private int no;
    private String name;
    private HeroNode left;
    private HeroNode right;

    public HeroNode(int no, String name) {
        this.no = no;
        this.name = name;
    }

    @Override
    public String toString() {
        return "HeroNode{" +
                "no=" + no +
                ", name='" + name + '\'' +
                '}';
    }

    public int getNo() {
        return no;
    }

    public void setNo(int no) {
        this.no = no;
    }

    public String getName() {
        return name;
    }

    public void setName(String name) {
        this.name = name;
    }

    public HeroNode getLeft() {
        return left;
    }

    public void setLeft(HeroNode left) {
        this.left = left;
    }

    public HeroNode getRight() {
        return right;
    }

    public void setRight(HeroNode right) {
        this.right = right;
    }

    //前序二叉树
    public void preOrder(){
        System.out.println(this);
        if(this.left != null){
            this.left.preOrder();
        }

        if(this.right != null){
            this.right.preOrder();
        }
    }

    //中序二叉树
    public void infixOrder(){
        if(this.left != null){
            this.left.infixOrder();
        }

        System.out.println(this);

        if(this.right != null){
            this.right.infixOrder();
        }
    }

    //后序二叉树
    public void postOrder(){
        if(this.left != null){
            this.left.postOrder();
        }

        if(this.right != null){
            this.right.postOrder();
        }

        System.out.println(this);
    }

    //前序遍历查找
    public HeroNode preOrderSearch(int no){
        if(this.no == no){
            return this;
        }

        HeroNode resNode = null;

        if(this.left != null){
            resNode = this.left.preOrderSearch(no);
        }

        if(resNode != null){
            return resNode;
        }

        if(this.right != null){
            resNode = this.right.preOrderSearch(no);
        }
        return resNode;
    }

    //中序遍历查找
    public HeroNode infixOrderSearch(int no){
        HeroNode resNode = null;

        if(this.left != null){
            resNode = this.left.infixOrderSearch(no);
        }

        if(resNode != null){
            return resNode;
        }

        if(this.no == no){
            return this;
        }

        if(this.right != null){
            resNode = this.right.infixOrderSearch(no);
        }

        return resNode;
    }

    //后序遍历查找
    public HeroNode postOrderSearch(int no){
        HeroNode resNode = null;

        if(this.left != null){
            resNode = this.left.postOrderSearch(no);
        }

        if(resNode != null){
            return resNode;
        }

        if(this.right != null){
            resNode = this.right.postOrderSearch(no);
        }

        if(this.no == no){
            return this;
        }
        return resNode;
    }

    //删除节点
    public void delNode(int no){
        if(this.left != null && this.left.no == no){
            this.left = null;
            return;
        }

        if(this.right != null && this.right.no == no){
            this.right = null;
            return;
        }

        if(this.left != null){
            this.left.delNode(no);
        }

        if(this.right != null){
            this.right.delNode(no);
        }
    }
}